The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To overcome the common defects of early convergence in the existing genetic algorithm, an improved genetic algorithm with new crossover operator and new crossover strategy was presented for the solution to the vehicle routing problem with soft time window (VRPTW). Experiments show that the improved genetic algorithm can dramatically reduce the number of same or similar chromosomes, and increase the...
Superposition principle of quantum theory is introduced in this paper. The genetic algorithm has been described by quantum superposition theory. It implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot...
In order to make full use of resources in distributed parallel computing system, and reduce general time cost for performing the algorithm, task scheduling and resource management model and low-layer resource supervision-control model are designed and implemented. The unpredictable system behavior is resolved, which is caused by dynamic change resources. The dynamic join-in of resources is allowed...
The mixed model assembly lines are a type of production line where a variety of product models similar with product characteristic are assembled. In the assembly line balancing problem, the tasks required to assemble the product model are allocated to workstations. Precedence graphs of all models should be combined to a non-cyclical joint precedence graph according to ranked positional weigh algorithm...
With the proliferation of location dependent applications in sensor networks, localization awareness becomes an essential capability of sensor nodes. Many localization algorithms have been proposed in recent years, in which DV-Hop is the most popular one. Intrinsically, localization is an optimization problem based on various distance/path measures. GA and SA are both widely used approaches toward...
Sensor scheduling for target tracking in a sensor network is a research hotspot for its effectiveness in improving performance of the network. If numbers of targets and sensors are very large, the scale of the problem may be too large to solve using traditional methods. A method based on modified particle swarm optimization algorithm (MPSO) is proposed to solve the problem. Firstly, extended Kalman...
A genetic algorithm (GA) was proposed to solve the resource constrained project scheduling problem (RCPSP), in which resources are renewable and there is a single mode to perform each activity. This work employed genetic algorithms to schedule project activities to minimize make-span subject to precedence constraints and resources availability. In the genetic algorithm, a new permutation of priority-based...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.